Recognisable Languages over Monads
نویسنده
چکیده
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of composing structures into bigger structures. It so happens that category theory has an abstract concept for this, namely a monad. The goal of this paper is to propose monads as a unifying framework for discussing existing algebras and designing new algebras.
منابع مشابه
Stone Duality and the Recognisable Languages over an Algebra
This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic and theoretical computer science and the algebraic theory of finite state automata. As a bi-product we obtain a general result about profinite completion, namely, that it is the dual under extended Stone duality of the recognisa...
متن کاملStructuring functional programs by using monads
The notion of monads originates from the category theory. It became popular in the programming languages community after Moggi proposed a way to use monads to structure denotational semantics. Wadler and others showed how this can be eeectively used as a methodology for building interpreters. Monads are capable of capturing individual language features in a modular way. This paper evaluates two...
متن کاملThe Different Aspects of Monads and Mixins
Around twenty years ago two important developments happened in the areas of modularity and reuse in programming languages. On the one hand, Moggi showed how computational effects found in impure languages could be simulated using the notion of monads from category theory. Inspired by Moggi’s work, Wadler showed how monads could be used to structure (purely functional) programs. On the other han...
متن کامل19th International Conference on Types for Proofs and Programs
We introduce update monads as a generalization of state monads. Update monads are thecompatible compositions of reader and writer monads given by a set and a monoid. Distributivelaws between such monads are given by actions of the monoid on the set.We also discuss a dependently typed generalization of update monads. Unlike simple updatemonads, they cannot be factored into a ...
متن کاملMonads for Functional Programming
The use of monads to structure functional programs is de scribed Monads provide a convenient framework for simulating e ects found in other languages such as global state exception handling out put or non determinism Three case studies are looked at in detail how monads ease the modi cation of a simple evaluator how monads act as the basis of a datatype of arrays subject to in place update and ...
متن کامل